TSTP Solution File: ITP099^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP099^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:57 EDT 2024
% Result : Theorem 0.40s 0.71s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 36 ( 5 unt; 13 typ; 0 def)
% Number of atoms : 60 ( 22 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 295 ( 26 ~; 17 |; 9 &; 234 @)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 2 ^ 32 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_sort3,type,
list_a: $tType ).
thf(decl_22,type,
minus_minus_nat: nat > nat > nat ).
thf(decl_31,type,
listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).
thf(decl_33,type,
listIn1417627087drop_a: nat > ( nat > a ) > nat > a ).
thf(decl_39,type,
drop_a: nat > list_a > list_a ).
thf(decl_45,type,
size_size_list_a: list_a > nat ).
thf(decl_46,type,
ord_less_nat: nat > nat > $o ).
thf(decl_47,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_48,type,
f: nat > a ).
thf(decl_49,type,
n: nat ).
thf(decl_50,type,
xs: list_a ).
thf(conj_0,conjecture,
( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) )
& ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
= ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p',conj_0) ).
thf(fact_187_not__le__imp__less,axiom,
! [X24: nat,X23: nat] :
( ~ ( ord_less_eq_nat @ X24 @ X23 )
=> ( ord_less_nat @ X23 @ X24 ) ),
file('/export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p',fact_187_not__le__imp__less) ).
thf(fact_35_i__append__i__drop__eq2,axiom,
! [X1: list_a,X9: nat,X2: nat > a] :
( ( ord_less_eq_nat @ ( size_size_list_a @ X1 ) @ X9 )
=> ( ( listIn1417627087drop_a @ X9 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1417627087drop_a @ ( minus_minus_nat @ X9 @ ( size_size_list_a @ X1 ) ) @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p',fact_35_i__append__i__drop__eq2) ).
thf(fact_70_nat__less__le,axiom,
( ord_less_nat
= ( ^ [X89: nat,X47: nat] :
( ( ord_less_eq_nat @ X89 @ X47 )
& ( X89 != X47 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p',fact_70_nat__less__le) ).
thf(fact_33_i__append__i__drop__eq1,axiom,
! [X9: nat,X1: list_a,X2: nat > a] :
( ( ord_less_eq_nat @ X9 @ ( size_size_list_a @ X1 ) )
=> ( ( listIn1417627087drop_a @ X9 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1312259492pend_a @ ( drop_a @ X9 @ X1 ) @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p',fact_33_i__append__i__drop__eq1) ).
thf(c_0_5,negated_conjecture,
~ ( ( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) )
& ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
=> ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
= ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_6,plain,
! [X24: nat,X23: nat] :
( ~ ( ord_less_eq_nat @ X24 @ X23 )
=> ( ord_less_nat @ X23 @ X24 ) ),
inference(fof_simplification,[status(thm)],[fact_187_not__le__imp__less]) ).
thf(c_0_7,negated_conjecture,
( ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
| ( ord_less_nat @ n @ ( size_size_list_a @ xs ) ) )
& ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) )
| ( ord_less_nat @ n @ ( size_size_list_a @ xs ) ) )
& ( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
| ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) )
& ( ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) )
| ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_8,plain,
! [X971: list_a,X972: nat,X973: nat > a] :
( ~ ( ord_less_eq_nat @ ( size_size_list_a @ X971 ) @ X972 )
| ( ( listIn1417627087drop_a @ X972 @ ( listIn1312259492pend_a @ X971 @ X973 ) )
= ( listIn1417627087drop_a @ ( minus_minus_nat @ X972 @ ( size_size_list_a @ X971 ) ) @ X973 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_35_i__append__i__drop__eq2])])]) ).
thf(c_0_9,plain,
! [X1476: nat,X1477: nat] :
( ( ord_less_eq_nat @ X1476 @ X1477 )
| ( ord_less_nat @ X1477 @ X1476 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
thf(c_0_10,plain,
! [X942: nat,X943: nat] :
( ( ord_less_nat @ X942 @ X943 )
<=> ( ( ord_less_eq_nat @ X942 @ X943 )
& ( X942 != X943 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_70_nat__less__le])])]) ).
thf(c_0_11,negated_conjecture,
( ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
| ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1417627087drop_a @ ( minus_minus_nat @ n @ ( size_size_list_a @ xs ) ) @ f ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
! [X1: list_a,X2: nat > a,X9: nat] :
( ( ( listIn1417627087drop_a @ X9 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1417627087drop_a @ ( minus_minus_nat @ X9 @ ( size_size_list_a @ X1 ) ) @ X2 ) )
| ~ ( ord_less_eq_nat @ ( size_size_list_a @ X1 ) @ X9 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X11: nat,X9: nat] :
( ( ord_less_eq_nat @ X9 @ X11 )
| ( ord_less_nat @ X11 @ X9 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
! [X1358: nat,X1359: nat] :
( ( ( ord_less_eq_nat @ X1358 @ X1359 )
| ~ ( ord_less_nat @ X1358 @ X1359 ) )
& ( ( X1358 != X1359 )
| ~ ( ord_less_nat @ X1358 @ X1359 ) )
& ( ~ ( ord_less_eq_nat @ X1358 @ X1359 )
| ( X1358 = X1359 )
| ( ord_less_nat @ X1358 @ X1359 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
thf(c_0_15,negated_conjecture,
( ~ ( ord_less_nat @ n @ ( size_size_list_a @ xs ) )
| ( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_16,negated_conjecture,
ord_less_nat @ n @ ( size_size_list_a @ xs ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
thf(c_0_17,plain,
! [X968: nat,X969: list_a,X970: nat > a] :
( ~ ( ord_less_eq_nat @ X968 @ ( size_size_list_a @ X969 ) )
| ( ( listIn1417627087drop_a @ X968 @ ( listIn1312259492pend_a @ X969 @ X970 ) )
= ( listIn1312259492pend_a @ ( drop_a @ X968 @ X969 ) @ X970 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_33_i__append__i__drop__eq1])])]) ).
thf(c_0_18,plain,
! [X9: nat,X11: nat] :
( ( ord_less_eq_nat @ X9 @ X11 )
| ~ ( ord_less_nat @ X9 @ X11 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,negated_conjecture,
( ( listIn1417627087drop_a @ n @ ( listIn1312259492pend_a @ xs @ f ) )
!= ( listIn1312259492pend_a @ ( drop_a @ n @ xs ) @ f ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
thf(c_0_20,plain,
! [X9: nat,X2: nat > a,X1: list_a] :
( ( ( listIn1417627087drop_a @ X9 @ ( listIn1312259492pend_a @ X1 @ X2 ) )
= ( listIn1312259492pend_a @ ( drop_a @ X9 @ X1 ) @ X2 ) )
| ~ ( ord_less_eq_nat @ X9 @ ( size_size_list_a @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
ord_less_eq_nat @ n @ ( size_size_list_a @ xs ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : ITP099^1 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.17 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n010.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Fri May 3 12:31:18 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.23/0.54 Running higher-order theorem proving
% 0.23/0.54 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.WFJoGHf6G3/E---3.1_23980.p
% 0.40/0.71 # Version: 3.1.0-ho
% 0.40/0.71 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.40/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.71 # Starting full_lambda_9 with 1500s (5) cores
% 0.40/0.71 # Starting new_ho_11 with 300s (1) cores
% 0.40/0.71 # Starting sh2l with 300s (1) cores
% 0.40/0.71 # Starting new_bool_6 with 300s (1) cores
% 0.40/0.71 # sh2l with pid 24137 completed with status 0
% 0.40/0.71 # Result found by sh2l
% 0.40/0.71 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.40/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.71 # Starting full_lambda_9 with 1500s (5) cores
% 0.40/0.71 # Starting new_ho_11 with 300s (1) cores
% 0.40/0.71 # Starting sh2l with 300s (1) cores
% 0.40/0.71 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.40/0.71 # Search class: HGHSM-FSLF32-MHSFFSBC
% 0.40/0.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.71 # Starting new_ho_10 with 163s (1) cores
% 0.40/0.71 # new_ho_10 with pid 24165 completed with status 0
% 0.40/0.71 # Result found by new_ho_10
% 0.40/0.71 # Preprocessing class: HSLSSMSSSSSNHSA.
% 0.40/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.71 # Starting full_lambda_9 with 1500s (5) cores
% 0.40/0.71 # Starting new_ho_11 with 300s (1) cores
% 0.40/0.71 # Starting sh2l with 300s (1) cores
% 0.40/0.71 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.40/0.71 # Search class: HGHSM-FSLF32-MHSFFSBC
% 0.40/0.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.71 # Starting new_ho_10 with 163s (1) cores
% 0.40/0.71 # Preprocessing time : 0.012 s
% 0.40/0.71 # Presaturation interreduction done
% 0.40/0.71
% 0.40/0.71 # Proof found!
% 0.40/0.71 # SZS status Theorem
% 0.40/0.71 # SZS output start CNFRefutation
% See solution above
% 0.40/0.71 # Parsed axioms : 286
% 0.40/0.71 # Removed by relevancy pruning/SinE : 75
% 0.40/0.71 # Initial clauses : 548
% 0.40/0.71 # Removed in clause preprocessing : 23
% 0.40/0.71 # Initial clauses in saturation : 525
% 0.40/0.71 # Processed clauses : 744
% 0.40/0.71 # ...of these trivial : 8
% 0.40/0.71 # ...subsumed : 203
% 0.40/0.71 # ...remaining for further processing : 532
% 0.40/0.71 # Other redundant clauses eliminated : 75
% 0.40/0.71 # Clauses deleted for lack of memory : 0
% 0.40/0.71 # Backward-subsumed : 2
% 0.40/0.71 # Backward-rewritten : 4
% 0.40/0.71 # Generated clauses : 1086
% 0.40/0.71 # ...of the previous two non-redundant : 911
% 0.40/0.71 # ...aggressively subsumed : 0
% 0.40/0.71 # Contextual simplify-reflections : 3
% 0.40/0.71 # Paramodulations : 976
% 0.40/0.71 # Factorizations : 4
% 0.40/0.71 # NegExts : 12
% 0.40/0.71 # Equation resolutions : 93
% 0.40/0.71 # Disequality decompositions : 0
% 0.40/0.71 # Total rewrite steps : 251
% 0.40/0.71 # ...of those cached : 171
% 0.40/0.71 # Propositional unsat checks : 0
% 0.40/0.71 # Propositional check models : 0
% 0.40/0.71 # Propositional check unsatisfiable : 0
% 0.40/0.71 # Propositional clauses : 0
% 0.40/0.71 # Propositional clauses after purity: 0
% 0.40/0.71 # Propositional unsat core size : 0
% 0.40/0.71 # Propositional preprocessing time : 0.000
% 0.40/0.71 # Propositional encoding time : 0.000
% 0.40/0.71 # Propositional solver time : 0.000
% 0.40/0.71 # Success case prop preproc time : 0.000
% 0.40/0.71 # Success case prop encoding time : 0.000
% 0.40/0.71 # Success case prop solver time : 0.000
% 0.40/0.71 # Current number of processed clauses : 143
% 0.40/0.71 # Positive orientable unit clauses : 28
% 0.40/0.71 # Positive unorientable unit clauses: 2
% 0.40/0.71 # Negative unit clauses : 24
% 0.40/0.71 # Non-unit-clauses : 89
% 0.40/0.71 # Current number of unprocessed clauses: 1020
% 0.40/0.71 # ...number of literals in the above : 3223
% 0.40/0.71 # Current number of archived formulas : 0
% 0.40/0.71 # Current number of archived clauses : 334
% 0.40/0.71 # Clause-clause subsumption calls (NU) : 48338
% 0.40/0.71 # Rec. Clause-clause subsumption calls : 8066
% 0.40/0.71 # Non-unit clause-clause subsumptions : 173
% 0.40/0.71 # Unit Clause-clause subsumption calls : 436
% 0.40/0.71 # Rewrite failures with RHS unbound : 0
% 0.40/0.71 # BW rewrite match attempts : 40
% 0.40/0.71 # BW rewrite match successes : 7
% 0.40/0.71 # Condensation attempts : 744
% 0.40/0.71 # Condensation successes : 18
% 0.40/0.71 # Termbank termtop insertions : 88406
% 0.40/0.71 # Search garbage collected termcells : 10428
% 0.40/0.71
% 0.40/0.71 # -------------------------------------------------
% 0.40/0.71 # User time : 0.139 s
% 0.40/0.71 # System time : 0.009 s
% 0.40/0.71 # Total time : 0.148 s
% 0.40/0.71 # Maximum resident set size: 4076 pages
% 0.40/0.71
% 0.40/0.71 # -------------------------------------------------
% 0.40/0.71 # User time : 0.148 s
% 0.40/0.71 # System time : 0.013 s
% 0.40/0.71 # Total time : 0.161 s
% 0.40/0.71 # Maximum resident set size: 2288 pages
% 0.40/0.71 % E---3.1 exiting
% 0.40/0.71 % E exiting
%------------------------------------------------------------------------------